Fast discrete cosine transform pruning

A new fast pruning algorithm is proposed for computing the IV, lowest frequency components of a Iength-~V discrete cosine transform, where AVO is any integer less than or equal to N, and AV = 2“‘. The computational complexity of the developed algorithm is lower than any of the existing algorithms, resulting in significant time savings. In the special case that AVO = 2 “ Q , the required number of multiplications and additions is $rnoL%’ and ( n z o + l)‘%-+ ( t i n o 2).V” + 1, respectively.